#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll d[20][10][20], A[20], k;

ll dp(int p, int c, bool lim, bool z){
    if(p==-1) return c;
    if(!lim && !z && d[p][k][c]!=-1) return d[p][k][c];
    ll m = lim?A[p]:9;
    ll ans = 0;
    for (int i = 0; i <= m; ++i) {
        if(i==0 && z) ans += dp(p-1, 0, lim&&i==m, true);
        else ans += dp(p-1, c+(i==k), lim&&i==m, false);
    }
    if(!lim && !z) d[p][k][c] = ans;
    return ans;
}

ll cal(ll x, int i){
    k = i;
    int p = 0;
    while (x) A[p++] = x%10, x/=10;
    return dp(p-1, 0, true, true);
}

int main() {
    ios::sync_with_stdio(false);cin.tie(nullptr);
    memset(d, -1, sizeof d);
    ll l, r; cin >> l >> r;
    for (int i = 0; i < 10; ++i) {
        if(i) cout << ' ';
        cout << cal(r, i) - cal(l-1, i);
    }
    return 0;
}